Pascal and Francis Bibliographic Databases

Help

Search results

Your search

au.\*:("YESHA Y")

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 30

  • Page / 2
Export

Selection :

  • and

Time-space tradeoffs for matrix multiplication and the discrete Fourier transform on Anyn general sequential random-access computerYESHA, Y.Journal of computer and system sciences (Print). 1984, Vol 29, Num 2, pp 183-197, issn 0022-0000Article

COMPLEXITY OF SOLVING ALGEBRAIC EQUATIONSFRAENKEL AS; YESHA Y.1980; INF. PROCESS. LETT.; ISSN 0020-0190; NLD; DA. 1980; VOL. 10; NO 4-5; PP. 178-179; BIBL. 2 REF.Article

On certain polynomial-time truth-table reducibilities of complete sets to sparse setsYESHA, Y.SIAM journal on computing (Print). 1983, Vol 12, Num 3, pp 411-425, issn 0097-5397Article

THEORY OF ANNIHILATION GAMES. IFRAENKEL AS; YESHA Y.1982; J. COMB. THEORY, SERV. B; ISSN 0095-8956; USA; DA. 1982; VOL. 33; NO 1; PP. 60-86; BIBL. 20 REF.Article

MEAN FLOW SCHEDULING AND OPTIMAL CONSTRUCTION OF A TREELIKE COMMUNICATION NETWORKPERL Y; YESHA Y.1981; NETWORKS; ISSN 0028-3045; USA; DA. 1981; VOL. 11; NO 1; PP. 87-92; BIBL. 10 REF.Article

THEORY OF ANNIHILATION GAMES.FRAENKEL AS; YESHA Y.1976; BULL. AMER. MATH. SOC.; U.S.A.; DA. 1976; VOL. 82; NO 5; PP. 775-777; BIBL. 3 REF.Article

Resource bounds for parallel computation of threshold and symmetric functionsMING LI; YESHA, Y.Journal of computer and system sciences (Print). 1991, Vol 42, Num 1, pp 119-137, issn 0022-0000, 19 p.Article

New lower bounds for parallel computationLI, M; YESHA, Y.Journal of the Association for Computing Machinery. 1989, Vol 36, Num 3, pp 671-680, issn 0004-5411Article

Parallel recognition and decomposition of two terminal series parallel graphsXIN HE; YESHA, Y.Information and computation (Print). 1987, Vol 75, Num 1, pp 15-38, issn 0890-5401Article

Efficient parallel algorithms for bipartite permutation graphsLIN CHEN; YESHA, Y.Networks (New York, NY). 1993, Vol 23, Num 1, pp 29-39, issn 0028-3045Article

A polynomial algorithm for computation of the probability of conflicts in a database under arbitrary data access distributionMUKESH SINGHAL; YESHA, Y.Information processing letters. 1988, Vol 27, Num 2, pp 69-74, issn 0020-0190Article

On the power of the linear array architecture for performing tree-structured computationsKALPAKIS, K; YESHA, Y.Journal of computer and system sciences (Print). 1995, Vol 50, Num 1, pp 1-10, issn 0022-0000Article

A nearly optimal parallel algorithm for constructing depth first spanning trees in planar graphsXIN HE; YESHA, Y.SIAM journal on computing (Print). 1988, Vol 17, Num 3, pp 486-491, issn 0097-5397Article

Separation and lower bounds for ROM and nondeterministic models of parallel computationMING LI; YESHA, Y.Information and computation (Print). 1987, Vol 73, Num 2, pp 102-128, issn 0890-5401Article

Upper and lower bounds on the makespan of schedules for tree dags on linear arraysKALPAKIS, K; YESHA, Y.Algorithmica. 1999, Vol 23, Num 2, pp 159-179, issn 0178-4617Article

Parallel recognition of the consecutive ones property with applicationsLIN CHEN; YESHA, Y.Journal of algorithms (Print). 1991, Vol 12, Num 3, pp 375-392, issn 0196-6774Article

String-matching cannot be done by a two-head one-way deterministic finite automationMING LI; YESHA, Y.Information processing letters. 1986, Vol 22, Num 5, pp 231-235, issn 0020-0190Article

The generalized Sprague-Grundy function and its invariance under certain mappingsFRAENKEL, A. S; YESHA, Y.Journal of combinatorial theory. Series A. 1986, Vol 43, Num 2, pp 165-177, issn 0097-3165Article

Computation times of NP sets of different densitiesHARTMANIS, J; YESHA, Y.Theoretical computer science. 1984, Vol 34, Num 1-2, pp 17-32, issn 0304-3975Conference Paper

On a unified framework for the evaluation of distributed quorum attainment protocolsMENASCE, D. A; YESHA, Y; KALPAKIS, K et al.IEEE transactions on software engineering. 1994, Vol 20, Num 11, pp 868-884, issn 0098-5589Article

Optimal allocation for partially replicated database systems on ring networksSTEPHENS, A. B; YESHA, Y; HUMENIK, K. E et al.IEEE transactions on knowledge and data engineering. 1994, Vol 6, Num 6, pp 975-982, issn 1041-4347Article

Algorithms for a core and k-tree core of a treePENG, S; STEPHENS, A. B; YESHA, Y et al.Journal of algorithms (Print). 1993, Vol 15, Num 1, pp 143-159, issn 0196-6774Article

Probabilistic analysis of transaction blocking under arbitrary data access distribution in database systemsMUKESH SINGHAL; YESHA, Y; LIU, M. T et al.Information sciences. 1994, Vol 78, Num 3-4, pp 161-187, issn 0020-0255Article

Extensions to the C programming language for enhanced fault detectionFLATER, D. W; YESHA, Y; PARK, E. K et al.Software, practice & experience. 1993, Vol 23, Num 6, pp 617-628, issn 0038-0644Article

Analytical performance modeling of hierarchical mass storage systemsPENTAKALOS, O. I; MENASCE, D. A; HALEM, M et al.IEEE transactions on computers. 1997, Vol 46, Num 10, pp 1103-1118, issn 0018-9340Article

  • Page / 2